A Programming Language Characterizing Quantum Polynomial Time
نویسندگان
چکیده
Abstract We introduce a first-order quantum programming language, named foq , whose terminating programs are reversible. restrict to strict and tractable subset, pfoq of with bounded width, that provides first language-based characterization the complexity class fbqp . finally present semantics-preserving algorithm compiling program circuit size polynomial in number input qubits.
منابع مشابه
Towards a quantum programming language
The field of quantum computation suffers from a lack of syntax. In the absence of a convenient programming language, algorithms are frequently expressed in terms of hardware circuits or Turing machines. Neither approach particularly encourages structured programming or abstractions such as data types. In this paper, we describe the syntax and semantics of a simple quantum programming language. ...
متن کاملA functional quantum programming language
This thesis introduces the language QML, a functional language for quantumcomputations on finite types. QML exhibits quantum data and control structures,and integrates reversible and irreversible quantum computations.The design of QML is guided by the categorical semantics: QML programs are in-terpreted by morphisms in the category FQC of finite quantum computations, whichpr...
متن کاملA Real-time Programming Language
Overview This chapter describes the syntax and semantics of the safemos programming language , SAFE. SAFE is a real-time sequential imperative language with input and output constructs and with deadline constraints. The model-based semantics described here are based on Interval Temporal Logic ?, ?], which captures timing properties in a natural way and also permits a uniform treatment of progra...
متن کاملQumin, a minimalist quantum programming language
In this work we introduce Qumin, a novel quantum programming language with a focus on providing an easy to use, minimalist, high-level, and easily extensible platform for quantum programming. Qumin’s design concentrates on encompassing the various interactions between classical and quantum computation via the use of two sublanguages: an untyped one that handles classical preparation and control...
متن کاملSemantics of a pure quantum programming language
Quantum algorithm is the key to dig the potential power of quantum computing and make quantum computation more efficient than classical analogue. However, present methods of designing quantum algorithms are too tricky and lack of systematic development. The aim of quantum programming languages is to deal with this problem and try to provide a high-level and unifying description and treatment of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2023
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-30829-1_8